首页> 外文OA文献 >Modeling item--item similarities for personalized recommendations on Yahoo! front page
【2h】

Modeling item--item similarities for personalized recommendations on Yahoo! front page

机译:建模项目 - 项目相似性的个性化建议   雅虎首页

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

We consider the problem of algorithmically recommending items to users on aYahoo! front page module. Our approach is based on a novel multilevelhierarchical model that we refer to as a User Profile Model with GraphicalLasso (UPG). The UPG provides a personalized recommendation to users bysimultaneously incorporating both user covariates and historical userinteractions with items in a model based way. In fact, we build a per-itemregression model based on a rich set of user covariates and estimate individualuser affinity to items by introducing a latent random vector for each user. Thevector random effects are assumed to be drawn from a prior with a precisionmatrix that measures residual partial associations among items. To ensurebetter estimates of a precision matrix in high-dimensions, the matrix elementsare constrained through a Lasso penalty. Our model is fitted through apenalized-quasi likelihood procedure coupled with a scalable EM algorithm. Weemploy several computational strategies like multi-threading, conjugategradients and heavily exploit problem structure to scale our computations inthe E-step. For the M-step we take recourse to a scalable variant of theGraphical Lasso algorithm for covariance selection. Through extensiveexperiments on a new data set obtained from Yahoo! front page and a benchmarkdata set from a movie recommender application, we show that our UPG modelsignificantly improves performance compared to several state-of-the-art methodsin the literature, especially those based on a bilinear random effects model(BIRE). In particular, we show that the gains of UPG are significant comparedto BIRE when the number of users is large and the number of items to selectfrom is small. For large item sets and relatively small user sets the resultsof UPG and BIRE are comparable. The UPG leads to faster model building andproduces outputs which are interpretable.
机译:我们考虑在aYahoo!上通过算法向用户推荐商品的问题。头版模块。我们的方法基于一种新颖的多层体系结构模型,我们将其称为带有GraphicalLasso(UPG)的用户配置文件模型。 UPG通过以基于模型的方式同时将用户协变量和历史用户交互与项目结合在一起,向用户提供个性化推荐。实际上,我们基于丰富的用户协变量集构建了每个项目的回归模型,并通过为每个用户引入潜在的随机向量来估计单个用户对商品的亲和力。假定矢量随机效应是从先验得出的,该先验具有一个精度矩阵,该精度矩阵可测量项之间的剩余部分关联。为了确保对高精确度矩阵的更好估计,矩阵元素通过套索罚分来约束。我们的模型通过附加的可扩展的EM算法通过变幻拟似然过程进行拟合。我们采用多种计算策略,例如多线程,共轭梯度和大量利用问题结构来扩展我们在E步中的计算。对于M步,我们求助于图形套索算法的可扩展变体进行协方差选择。通过对从Yahoo!获得的新数据集的广泛实验。从电影推荐器应用程序的首页和基准数据集可以看出,与文献中的几种最新方法相比,尤其是基于双线性随机效应模型(BIRE)的方法,我们的UPG模型显着提高了性能。尤其是,我们表明,当用户数量很大且要选择的项目数量很少时,UPG的收益与BIRE相比是可观的。对于大型项目集和相对较小的用户集,UPG和BIRE的结果是可比的。 UPG可以加快模型构建的速度,并产生可解释的输出。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号